package jjn.carl.dp;

import java.util.Scanner;

/**
 * @author Jjn
 * @since 2023/8/4 23:56
 */
public class LeetCode746 {
    public int minCostClimbingStairs(int[] cost) {
        int[] dp = new int[cost.length + 1];
        dp[0] = 0;
        dp[1] = 0;
        for (int i = 2; i <= cost.length; i++) {
            dp[i] = Math.min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
        }
        return dp[cost.length];
    }
    
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNext()) {
            int total = scanner.nextInt();
            int[] cost = new int[total];
            for (int i = 0; i < total; i++) {
                cost[i] = scanner.nextInt();
            }
            int minCostClimbingStairs = new LeetCode746().minCostClimbingStairs(cost);
            System.out.println(minCostClimbingStairs);
        }
    }
}
